Logical Characterisations of Inductive Learning
نویسنده
چکیده
This chapter presents a logical analysis of induction. Contrary to common approaches to inductive logic that treat inductive validity as a real-valued generalisation of deductive validity, we argue that the only logical step in induction lies in hypothesis generation rather than evaluation. Inspired by the seminal paper of Kraus, Lehmann and Magidor [Kraus et al., 1990] we analyse the logic of inductive hypothesis generation on the meta-level of consequence relations. Two main forms of induction are considered: explanatory induction, aimed at inducing a general theory explaining given observations, and confirmatory induction, aimed at characterising completely or partly observed models. Several sets of meta-theoretical properties of inductive consequence relations are considered, each of them characterised by a suitable semantics. The approach followed in this chapter is extensively motivated by referring to recent and older work in philosophy, logic, and machine learning.
منابع مشابه
Refining Inductive Types
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information. For example, the N-indexed type of vectors refines lists by their lengths. Other data types may be refined in similar ways, but programmers must produce ...
متن کاملTowards a Logical Model of Induction from Examples and Communication
This paper focuses on a logical model of induction, and specifically of the common machine learning task of inductive concept learning (ICL). We define an inductive derivation relation, which characterizes which hypothesis can be induced from sets of examples, and show its properties. Moreover, we will also consider the problem of communicating inductive inferences between two agents, which cor...
متن کاملWhen Is a Type Refinement an Inductive Type?
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of par-ticular use in dependently typed programming are indexed types that refine data by computationally useful information. For example, the Nindexed type of vectors refines lists by their lengths. Other data types may be refined in similar ways, but programmers must produce ...
متن کاملTop-down induction of logical decision trees
Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...
متن کاملLogical and Relational Learning
I use the term logical and relational learning (LRL) to refer to the subfield of machine learning and data mining that is concerned with learning in expressive logical or relational representations. It is the union of inductive logic programming, (statistical) relational learning and multi-relational data mining and constitutes a general class of techniques and methodology for learning from str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000